Optimal Symbol-by-Symbol Detection for Duobinary Signaling

Optimal Sequence Detection and Optimal Symbol-by- Symbol Detection: Similar Algorithms

An algorithm is derived which performs optimal symbolby-symbol detection of a pulse amplitude modulated sequence. The algorithm is similar to the Viterhi algorithm with the optimality criterion optimal symbol detection rather than optimal sequence detection. A salient common feature is the merge phenomenon which allows common decisions to be made before the entire sequence is received.

Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication

In this paper, symbol-by-symbol maximum likelihood (ML) detection is proposed for a cooperative diffusionbased molecular communication (MC) system. In this system, a fusion center (FC) chooses the transmitter (TX) symbol that is more likely, given the likelihood of its observations from multiple receivers (RXs), where the TX sends a common information symbol to all RXs. The transmission of a se...

An optimum symbol-by-symbol decoding rule for linear codes

A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.

Detection with embedded known symbols: optimal symbol placement and equalization

Symbol-by-Symbol MAP Decoding of Variable Length Codes

In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...